Games and Full Abstraction for the Lazy -calculus
نویسندگان
چکیده
We deene a category of games G, and its extensional quotient E. A model of the lazy-calculus, a type-free functional language based on evaluation to weak head normal form, is given in G, yielding an extensional model in E. This model is shown to be fully abstract with respect to applicative simulation. This is, so far as we know, the rst purely semantic construction of a fully abstract model for a reeexively-typed sequential language.
منابع مشابه
Full Abstraction by Translation
This paper shows how a fully abstract model for a rich metalanguage like FPC can be used to prove theorems about other languages. In particular, we use results obtained from a game semantics of FPC to show that the natural translation of the lazy-calculus into the metalanguage is fully abstract, thus obtaining a new full abstraction result from an old one. The proofs involved are very easy|all ...
متن کاملGame Semantics for the Pure Lazy λ - calculus ?
In this paper we present a fully abstract game model for the pure lazy λ-calculus, i.e. the lazy λ-calculus without constants. In order to obtain this result we introduce a new category of games, the monotonic games, whose main characteristic consists in having an order relation on moves.
متن کاملState Focusing: Lazy Abstraction for the Mu-Calculus
A key technique for the verification of programs is counterexampleguided abstraction refinement (CEGAR). In a previous approach, we developed a CEGAR-based algorithm for the modal μ-calculus, where refinement applies only locally, i.e. lazy abstraction techniques are used. Unfortunately, our previous algorithm was not completely lazy and had some further drawbacks, like a possible local state e...
متن کاملA Fully Abstract Semantics for Concurrent Graph Reduction
This paper presents a fully abstract semantics for a variant of the untyped λ-calculus with recursive declarations. We first present a summary of existing work on full abstraction for the untyped λ-calculus, concentrating on ABRAMSKY and ONG’s work on the lazy λ-calculus. ABRAMSKY and ONG’s work is based on leftmost outermost reduction without sharing. This is notably inefficient, and many impl...
متن کاملLazy functions and mobile processes
This paper continues the study of Milner's encoding of the lazy-calculus into the-calculus Mil90]. The encoding is shown to give rise to a-model in which, in accordance with the theory of the lazy-calculus, conditional extensionality holds. However, the model is not fully abstract. To obtain full abstraction, the operational equivalence on-terms (applicative bisimulation) is reened. The new rel...
متن کامل